An efficient dual approach to the urban road network design problem
نویسندگان
چکیده
منابع مشابه
An outer approximation method for the road network design problem
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybri...
متن کاملAn Approach to Solving the Survivable Capacitated Network Design Problem
Survivability refers to keeping a system partially or fully operational when one or more of its components fail. Survivability in telecommunication networks is crucial, as failure of a network component can potentially bring down the whole communication network, as happened in some real-world cases. Adding redundant network components increases the survivability of a network, but cost of the ne...
متن کاملAn Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption
Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability o...
متن کاملAn efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-t ime approximation algorithm was given by Williamson et al. (Combinatorica 15 (1995) 435454) . This paper gives an improved version that is more efficient. Consider a graph of n vertices and connectivity requirements that are at most...
متن کاملA turning restriction design problem in urban road networks
Turning restriction is one of the commonest traffic management techniques and an effective low cost traffic improvement strategy in urban road networks. However, the literature has not paid much attention to the turning restriction design problem (TRDP), which aims to determine a set of intersections where turning restrictions should be implemented. In this paper, a bi-level programming model i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1979
ISSN: 0898-1221
DOI: 10.1016/0898-1221(81)90134-6